l-Penalized Minimization Problems
نویسنده
چکیده
Most of the inverse problems arising in applied electromagnetics come from an underdetermined direct problem, this is the case, for instance, of spatial resolution enhancement. This implies that no unique inverse operator exists; therefore, additional constraints must be imposed on the sought solution. When dealing with microwave remote sensing, among the possible choices, the minimum p–norm constraint, with 1 < p ≤ 2, allows obtaining reconstructions in Hilbert (p = 2) and Banach (1 < p < 2) subspaces. Recently, it has been experimentally proven that reconstructions in Banach subspaces mitigate the oversmoothing and the Gibbs oscillations that typically characterize reconstructions in Hilbert subspaces. However, no fair intercomparison among the different reconstructions has been done. In this paper, a mathematical framework to analyze reconstructions in Hilbert and Banach subspaces is provided. The reconstruction problem is formulated as the solution of a p–norm constrained minimization problem. Two signals are considered that model abrupt and spot-like discontinuities. The study, undertaken in both the noise-free and the noisy cases, demonstrates that l reconstructions for 1 < p < 2 significantly outperform the l ones when spot-like discontinuities are considered; when dealing with abrupt discontinuities, l and l reconstructions are characterized by similar performance; however, l reconstructions exhibit oscillations when the background is not properly accounted for.
منابع مشابه
On the performance of algorithms for the minimization of l1-penalized functionals
The problem of assessing the performance of algorithms used for the minimization of an l1-penalized least-squares functional, for a range of penalty parameters, is investigated. A criterion that uses the idea of ‘approximation isochrones’ is introduced. Five different iterative minimization algorithms are tested and compared, as well as two warm-start strategies. Both well-conditioned and ill-c...
متن کاملMinimization and Parameter Estimation for Seminorm Regularization Models with I-Divergence Constraints
In this papers we analyze the minimization of seminorms ‖L · ‖ on R under the constraint of a bounded I-divergence D(b,H ·) for rather general linear operators H and L. The I-divergence is also known as Kullback-Leibler divergence and appears in many models in imaging science, in particular when dealing with Poisson data. Often H represents, e.g., a linear blur operator and L is some discrete d...
متن کاملOracle Inequalities in Empirical Risk Minimization and Sparse Recovery Problems
A number of problems in nonparametric statistics and learning theory can be formulated as penalized empirical risk minimization over large function classes with penalties depending on the complexity of the functions (decision rules) involved in the problem. The goal of mathematical analysis of such procedures is to prove ”oracle inequalities” describing optimality properties of penalized empiri...
متن کاملAn approximation algorithm and FPTAS for Tardy/Lost minimization with common due dates on a single machine
This paper addresses the Tardy/Lost penalty minimization with common due dates on a single machine. According to this performance measure, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Initially, we present a 2-approximation algorithm and examine its worst case ratio bound. Then, a pseudo-polynomial dynamic programming algorithm is de...
متن کاملSolution of Linear Systems Arising in
This paper deals with the solution of large linear systems which arise when certain optimization methods are applied in image de-blurring. An unconstrained penalized least squares minimization problem with total variation penalty is considered. Also addressed are several penalized least squares problems with nonnegativity constraints imposed on the solution. In each case, quasi-Newton technique...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015